CAD model acquisition using BSP trees
نویسندگان
چکیده
This paper discusses an approach to automating C A D model acquisition b y creating Binary Space Partitioning (BSP trees f rom laser range d a t a . Distinct are then merged using set operations. BSP trees have proven their utility in 3-D modeling, graphics and ima g e processing, and their tree structure allows ef ic ient algorithms to be developed that are compact and numerically robust. These properties are of primary importance when considering an intermediate representation between raw sensor d a t a and existing C A D models. views of the o 6 ject , each represented b y a B S P tree,
منابع مشابه
CAD Model Acquisition using Binary Space Partitioning Trees
This paper discusses an approach to automating CAD model acquisition by creating Binary Space Partitioning (BSP) trees from laser range data. Distinct views of the object, each represented by a BSP tree, are then merged using set operations on the trees. BSP trees have proven their utility in 3-D modeling, graphics and image processing, and their tree structure allows efficient algorithms to be...
متن کاملApplication of Binary Spatial Partitioning to Computer Aided Design
Computer Aided Design (CAD) applications usually need to store and process dynamically and efficiently various drawing elements. Typically the quad-tree data structure is used in 2 dimensions and the octant-tree data structure in 3 dimensions. Here the Binary Spatial Partitioning (BSP) tree data structure is proposed for CAD applications. BSP scales better in irregular geometries such as long n...
متن کاملConstructive Solid Geometry Using BSP Tree
Constructive solid geometry (CSG) is a pivotal component of CAD and CAE packages. CSG allows us to represent complex shapes and models as a series of Boolean operations between primitives. For example, punching a hole through a cube would be difficult to represent with an implict or explicit funciton. The CSG algorithm we have developed allows something like this to be represented as a simple B...
متن کاملImproved Binary Space Partition merging
This paper presents a new method for evaluating boolean set operations between Binary Space Partition (BSP) trees. Our algorithm has many desirable features including both numerical robustness and O(n) output sensitive time complexity, while simultaneously admitting a straightforward implementation. To achieve these properties, we present two key algorithmic improvements. The first is a method ...
متن کاملDeferred, Self-Organizing BSP Trees
BSP trees and KD trees are fundamental data structures for collision detection in walkthrough environments. A basic issue in the construction of these hierarchical data structures is the choice of cutting planes. Rather than base these choices solely on the properties of the scene, we propose using information about how the tree is used in order to determine its structure. We demonstrate how th...
متن کامل